Multiobjective differential evolution for scheduling workflow applications on global Grids
نویسندگان
چکیده
Most algorithms developed for scheduling applications on global Grids focus on a single Quality of Service (QoS) parameter such as execution time, cost or total data transmission time. However, if we consider more than one QoS parameter (e.g. execution cost and time, which may be in conflict) then the problem becomes more challenging. To handle such scenarios, it is convenient to use heuristics rather than a deterministic algorithm. In this paper, we have proposed a workflow execution planning approach using Multiobjective Differential Evolution (MODE). Our goal was to generate a set of trade-off schedules according to two user specified QoS requirements (time and cost), which will offer more flexibility to users when estimating their QoS requirements. We have compared our results with a well-known baseline algorithm ‘Pareto-archived Evolutionary Strategy (PAES)’. Simulation results show that the modified MODE is able to find significantly better spread of compromise solutions compared with that of PAES. Copyright © 2009 John Wiley & Sons, Ltd.
منابع مشابه
Multi-objective and Scalable Heuristic Algorithm for Workflow Task Scheduling in Utility Grids
To use services transparently in a distributed environment, the Utility Grids develop a cyber-infrastructure. The parameters of the Quality of Service such as the allocation-cost and makespan have to be dealt with in order to schedule workflow application tasks in the Utility Grids. Optimization of both target parameters above is a challenge in a distributed environment and may conflict one an...
متن کاملA Novel Approach for Realising Superscalar Programming Model on Global Grids
This paper presents a novel approach for the design and implementation of Grid Superscalar (GS) model on top of GWFE (Gridbus Workflow Engine). This new workflow-based version of the GS framework enables the easy development of applications (without the need of explicit expression of parallelism/distribution by the programmer) and scheduling them on Global Grids using the GSB (Gridbus Service B...
متن کاملSurvivability and Makespan Driven Scheduling Algorithm for Grid Workflow Applications
With the development of Grid technologies, scientists and engineers obtain large computing capability to execute large-scale workflow applications. However the Grids also bring a troublesome problem. In the dynamic, complex and unbounded Grid systems, malicious attacks and hardware faults, which are inevitable, can have a serious effect on the execution of applications. Therefore it is necessar...
متن کاملMin-Cost with delay Scheduling for Large Scale Cloud-Based Workflow Applications Platform
Cloud computing is a promising solution to provide the resource scalability dynamically. In order to support large scale workflow applications, we present Nuts-LSWAP which is implementation for Cloud workflow. Then, a novel Min-cost with delay scheduling algorithm is presented in this paper. We also focuses on the global scheduling including genetic evolution method and other scheduling methods...
متن کاملReputation-based dependable scheduling of workflow applications in Peer-to-Peer Grids
Grids facilitate creation of wide-area collaborative environment for sharing computing or storage resources and various applications. Inter-connecting distributed Grid sites through peer-to-peer routing and information dissemination structure (also known as Peer-to-Peer Grids) is essential to avoid the problems of scheduling efficiency bottleneck and single point of failure in the centralized o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Concurrency and Computation: Practice and Experience
دوره 21 شماره
صفحات -
تاریخ انتشار 2009